The Role of Learning and Development in Language Evolution: A Connectionist Perspective Morten H. Christiansen and Rick Dale Department of Psychology Cornell University Ithaca, NY 14853

Source URL: cnl.psych.cornell.edu

• Linguistics
• Grammar
• Linguistic typology
• Human communication
• Language
• Regular and irregular verbs
• Inflection
• Grammatical tense
• Verb
• Word order
• Morphology
• Phrase

Foundations of XML Types: Tree Automata Pierre Genevès CNRS (slides mostly based on slides by W. Martens and T. Schwentick) University of Grenoble Alpes, 2015–2016

Source URL: tyrex.inria.fr

• Formal languages
• Tree automaton
• Binary tree
• Tree
• Regular tree grammar
• Parity
• Alphabet
• Arity
• Even

BEHAVIORAL AND BRAIN SCIENCES, 991–1060 Printed in the United States of America Lexical entries and rules of language: A multidisciplinary study of German inflection

Source URL: www.uni-potsdam.de

• Linguistic morphology
• English grammar
• Grammar
• Inflection
• Participle
• Verb
• Regular and irregular verbs
• Grammatical tense
• Past tense
• Suffix
• English irregular verbs
• Proto-Indo-European verbs

CS 340, Fall 2014 — Dec 11th /13th — Final Exam Name: Note: in all questions, the special symbol  (epsilon) is used to indicate the empty string. Questionpoints] Consider the following regular expression;

Source URL: ycpcs.github.io

• Formal languages
• Compiler construction
• Pattern matching
• Syntax
• Parsing
• Context-free grammar
• Formal grammar
• Terminal and nonterminal symbols
• Lexical analysis
• Recursive descent parser
• Sequence
• Regular expression

< PAGE >1 Regular Expression Grammar 7-Feb-2002Regular Expression Grammar 7-Feb-2002 < PAGE >1Unicode Character Classes UnicodeCharacterUnicodeCharacter  Any Unicode character UnicodeAlpha

Source URL: www-archive.mozilla.org

Automatic construction of parse trees for lexemes ∗ Danny Dub´e Anass Kadiri Universit´e Laval

Source URL: schemeworkshop.org

• Formal languages
• Computing
• Automata theory
• Models of computation
• Parsing
• Lexical analysis
• Context-free grammar
• Parse tree
• Regular expression
• Programming language implementation
• Software engineering
• Compiler construction

‘Computing’ as Information Compression by Multiple Alignment, Unification and Search∗ J Gerard Wolff (University of Wales, Bangor, UK )

Source URL: www.cognitionresearch.org

• Science
• Formal sciences
• Bioinformatics
• Formal grammar
• Regular expression
• Universal Turing machine
• Pattern matching
• Unification
• Pattern
• Applied mathematics
• Formal languages
• Mathematics

Developing multi-level grammars in a framework of information compression by multiple alignment, unification and search Gerry Wolff CognitionResearch.org.uk Menai Bridge, UK.

Source URL: www.cognitionresearch.org

• Grammar
• Context-free grammar
• Formal grammar
• LL parser
• Regular expression
• Pattern
• Pattern theory
• Controlled grammar
• Formal languages
• Combinatorics
• Software engineering

BRICS Basic Research in Computer Science BRICS RS-03-5 Christensen et al.: Precise Analysis of String Expressions

Source URL: www.brics.dk

• Software engineering
• Context-free grammar
• Formal grammar
• Terminal and nonterminal symbols
• Regular grammar
• Production
• Regular expression
• Static single assignment form
• Parsing expression grammar
• Formal languages
• Combinatorics
• Mathematics

The Icon Analyst In-Depth Coverage of the Icon Programming Language October 1998 Number 50 In this issue …

Source URL: www.cs.arizona.edu

• Computer programming
• Formal grammar
• L-system
• Icon
• LL parser
• Regular expression
• Attribute grammar
• Formal languages
• Software engineering
• Computing